The ternary Golay code, the integers mod 9, and the Coxeter-Todd lattice

نویسندگان

  • A. Robert Calderbank
  • N. J. A. Sloane
چکیده

The 12-dimensional Coxeter-Todd lattice can be obtained by lifting the ternary Golay code to a code over the integers mod 9 and applying Construction A. Several recent papers have pointed out connections between codes over & and lattices [l], [3]. It is the a m of this correspondence to show that the Coxeter-Todd lattice K12 ([4], [5, ch. 4, sec. 91) can be obtained in a similar way from a code over Eg. Let +, = z fmz denote the ring of integers mod m. Let C be a cyclic code of length n over &, where p is a pnme such that ( n , p ) = 1, with generator polynomial g(z). If a is a primitive element of &, let S denote the set of s such that 0’ is a root of g(z). ‘it is pointed out in [2] that C is self-orthogonal if and only if S U (-S) contains representatives from every residue class modn. Furthermore, for a = 2,3, . . . , exactly the same condition is also necessary and sufficient for the Hensel lift (cf. [6]) of C to a cyclic code over Zp to be self-orthogonal mod p a . Self-orthogonality of the lifted code is a purely combinatorial property of the roots of the original code. Consider now the [ll, 5,6] self-orthogonal ternary Golay code, with generator polynomial g(z) = z6 z5 E4 zs + x2 + 1 ([7, p. 4821). This lifts to G ( ~ ) =2 + 2z5 4x4 + zZ3 + xz 3x + 1 a divisor of zil 1 mod 9, which by the previous remark generates a self-orthogonal code over &. Appending a 0 to these words and adjoining the all-1’s vector as an additional generator, we obtain a self-dual code 4 of length 12 over &. By applying Construction A (cf. [5, chs. 5, 7]) , that is, taking all vectors in El2 that are congruent to any codeword of 6 mod 9, and rescaling by dividing by &, we obtain the Coxeter-Todd lattice: a 12-dimensional lattice of determinant 729, minimal squared length 4, and 756 minimal vectors. We omit the straightforward proof that this is isomorphic to the standard construction from a code (the “hexacode”) of length 6 over GF(4) ([4], [ 5 , p. 1281, [SI).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code

Abstmct Two soft-decision algorithms f o r decoding the (6,3,4) q u a t e r n a r y code, the hezocode, are p resented. Both algorithms have the same guaranteed error cor rec t ion radius as that of maximum-likelihood decoding. In using them, bounded-distance decoding of the Golay code and the Leech lattice are performed i n at most 187 and 519 real operations respectively. We present s o m e s...

متن کامل

A generalisation of Turyn’s construction of self-dual codes

In [17] Turyn constructed the famous binary Golay code of length 24 from the extended Hamming code of length 8 (see also [10, Theorem 18.7.12]). The present note interprets this construction as a sum of tensor products of codes and uses it to construct certain new extremal (or at least very good) self-dual codes (for example an extremal doubly-even binary code of length 80). The lattice counter...

متن کامل

Golay Codes

We discuss a specific type of error-control coding using Golay codes. First we introduce the basics of coding. Then we discuss the Golay code in binary form, extended binary form, and ternary form.

متن کامل

The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions

Abstmct-Multilevel constructions of the binary Golay code and the Leech lattice are described. Both constructions are based upon the prvjection of the Golay code and the Leech lattice onto the (6,3,4) hexacode over GF(4). However, unlike the previously reported constructiods, the new multilevel constructions make the three levels independent by way of using a didlerent set of coset representati...

متن کامل

Yet another approach to the extended ternary Golay code

A new proof of the uniqueness and of the existence of the extended ternary Golay code is presented. The proof connects the code to the projective plane of order 3 and is of an elementary nature. The available proofs of the uniqueness of the extended ternary Golay code [2,7] are much more complicated than the standard corresponding proof in the binary case [2]. The prevailing opinion seems to be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1996